The Resolution of the Generic Residual Intersection of a Complete Intersection
نویسندگان
چکیده
The concept of residual intersection, introduced by Artin and Nagata [l] in 1972, is a fruitful generalization of linkage as the following two examples attest. Let I be a strongly Cohen-Macaulay ideal in a CohenMacaulay local ring R. If Z satisfies the condition (G,), then Huneke [6, Proposition 4.31 has proved that the extended Rees algebra R[It, t‘1 is defined by an ideal which is obtained from I by way of residual intersection. Since the extended Rees algebra is a deformation of both the Rees algebra R[It] and the associated graded algebra gZ’/I” ‘, it contains considerable information about the analytic properties of I. (The definitions of residual intersection, strongly Cohen-Macaulay, and (G,) may be found in Section 4.) Huneke [6, Theorem 4.11 has also shown that the ideal .I, generated by the maximal order minors of a generic n x m matrix, is a residual intersection of a generic codimension two Cohen-Macaulay ideal. Since J is rather poorly behaved with respect to linkage [S], it is promising that it is close to a well understood ideal once we weaken the tie from linkage to residual intersection.
منابع مشابه
Local Cohomology with Respect to a Cohomologically Complete Intersection Pair of Ideals
Let $(R,fm,k)$ be a local Gorenstein ring of dimension $n$. Let $H_{I,J}^i(R)$ be the local cohomology with respect to a pair of ideals $I,J$ and $c$ be the $inf{i|H_{I,J}^i(R)neq0}$. A pair of ideals $I, J$ is called cohomologically complete intersection if $H_{I,J}^i(R)=0$ for all $ineq c$. It is shown that, when $H_{I,J}^i(R)=0$ for all $ineq c$, (i) a minimal injective resolution of $H_{I,...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملIdentification of Hazardous Situations using Kernel Density Estimation Method Based on Time to Collision, Case study: Left-turn on Unsignalized Intersection
The first step in improving traffic safety is identifying hazardous situations. Based on traffic accidents’ data, identifying hazardous situations in roads and the network is possible. However, in small areas such as intersections, especially in maneuvers resolution, identifying hazardous situations is impossible using accident’s data. In this paper, time-to-collision (TTC) as a traffic conflic...
متن کاملSOME RESULTS ON THE COMPLEMENT OF THE INTERSECTION GRAPH OF SUBGROUPS OF A FINITE GROUP
Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...
متن کامل